Combinatorial Group Theory
نویسنده
چکیده
An early version of these notes was prepared for use by the participants in the Workshop on Algebra, Geometry and Topology held at the Australian National University, 22 January to 9 February, 1996. They have subsequently been updated and expanded many times for use by students in the subject 620-421 Combinatorial Group Theory at the University of Melbourne. Copyright 1996-2004 by C. F. Miller III.
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملEfficient SSD Integrity Verification Program Based on Combinatorial Group Theory
In digital forensics, the issue of data integrity protection for increasingly widespread applied SSD (Solid State Disk, SSD) is to be resolved. Based on Combinatorial Group Theory, mapping data objects in SSD validation process and test object in combination group testing methods, using the non-adaptive mode to the initial calculation, stored procedures, and re-calculate, verify process, and ca...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملSome combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملA generalization of the probability that the commutator of two group elements is equal to a given element
The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with combinatorial techniques. Here we illustrate that a wider context may be considered and show some structural restrictions on the group.
متن کاملRobinson-Schensted algorithm and Vogan equivalence
We provide a combinatorial proof for the coincidence of Knuth equivalence classes, Kazhdan–Lusztig left cells and Vogan classes for the symmetric group, involving only Robinson-Schensted algorithm and the combinatorial part of the Kazhdan–Lusztig cell theory. The determination of Kazhdan–Lusztig cells for the symmetric group is given in the proof of [4, Thm1.4]. The argument is largely combinat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004